Asymptotically optimal load balancing in large-scale heterogeneous systems with multiple dispatchers
نویسندگان
چکیده
Abstract We consider the load balancing problem in large-scale heterogeneous systems with multiple dispatchers. introduce a general framework called Local-Estimation-Driven (LED). Under this framework, each dispatcher keeps local (possibly outdated) estimates of queue lengths for all servers, and dispatching decision is made purely based on these estimates. The are updated via infrequent communications between dispatchers servers. derive sufficient conditions LED policies to achieve throughput optimality delay heavy-traffic, respectively. These directly imply many previous local-memory heavy traffic. Moreover, results enable us design new optimal Finally, heavy-traffic also sheds light recent open question how schemes using delayed information.
منابع مشابه
Analysis of Load Balancing in Large Heterogeneous Processor Sharing Systems
We analyze randomized dynamic load balancing schemes for multi-server processor sharing systems when the number of servers in the system is large and the servers have heterogeneous service rates. In particular, we focus on the classical power-of-two load balancing scheme and a variant of it in which a newly arrived job is assigned to the server having the least instantaneous Lagrange shadow cos...
متن کاملOptimal Load Balancing in Millimeter Wave Cellular Heterogeneous Networks
In this paper, we propose a novel and effective approach to optimizing the load balancing in a millimeter wave (mmWave) cellular heterogeneous network (HetNet) with a macro-tier and a micro-tier. The unique characteristics of mmWave transmission are incorporated into the network by adopting the Poisson point process (PPP) for base station (BS) location, the line-of-sight (LoS) ball model for mm...
متن کاملOptimal load sharing in dynamically heterogeneous systems
Heterogeneity of processor speed and time availability is introduced to the paradigm of load sharing among a number of autonomous and independently scheduled heterogeneous computers that communicate via a message-passing interconnection system. A divisible job originating at one of the system sites is to be partitioned and executed concurrently on a suite of selected processors, to the extent o...
متن کاملAn Adaptive Load Balancing Algorithm for Heterogeneous Distributed Systems with Multiple Task Classes
We propose an adaptive load balancing algorithm for heterogeneous distributed systems. The algorithm intrinsically allows a batch of tasks to be relocated. The key of the algorithm is to transfer a suitable amount of processing demand from senders to receivers. This amount is determined dynamically during sender-receiver negotiations. Factors considered when this amount is determined include pr...
متن کاملAsymptotically Optimal Algorithms for Pickup and Delivery Problems with Application to Large-Scale Transportation Systems
Pickup and delivery problems (PDPs), in which objects or people have to be transported between specific locations, are among the most common combinatorial problems in real-world operations. A widely-encountered type of PDP is the Stacker Crane Problem (SCP), where each commodity/customer is associated with a pickup location and a delivery location, and the objective is to find a minimum-length ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance Evaluation
سال: 2021
ISSN: ['0166-5316', '1872-745X']
DOI: https://doi.org/10.1016/j.peva.2020.102146